Comparing Locality of Reference – Some Folk Theorems for the Miss Rates and the Output of Caches

نویسندگان

  • Armand M. Makowski
  • Sarut Vanichpun
چکیده

The performance of demand-driven caching is known to depend on the locality of reference exhibited by the stream of requests made to the cache. In spite of numerous efforts, no consensus has been reached on how to formalize this notion, let alone on how to compare streams of requests on the basis of their locality of reference. We take on this issue with an eye towards validating operational expectations associated with the notion of locality of reference. We focus on two “folk theorems,” namely (i) The stronger locality of reference, the smaller the miss rate of the cache; (ii) Good caching is expected to produce an output stream of requests exhibiting less locality of reference than the input stream of requests. We discuss these two folk theorems in the context of a cache operating under a demand-driven replacement policy when document requests are modeled according to the Independent Reference Model (IRM). As we propose to measure strength of locality of reference in a stream of requests through the skewness of its popularity distribution, we introduce the notion of majorization as a mean for capturing this degree of skewness. We show that these folk theorems hold for caches operating under a large class of cache replacement policies, including the optimal policy A0 and the random policy, but may fail under the LRU policy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparing Strength of Locality of Reference: Popularity, Temporal Correlations, and Some Folk Theorems for the Miss Rates and Outputs of Caches

Title of dissertation: COMPARING STRENGTH OF LOCALITY OF REFERENCE: POPULARITY, TEMPORAL CORRELATIONS, AND SOME FOLK THEOREMS FOR THE MISS RATES AND OUTPUTS OF CACHES Sarut Vanichpun, Doctor of Philosophy, 2005 Dissertation directed by: Professor Armand M. Makowski Department of Electrical and Computer Engineering and Institute for Systems Research The performance of demand-driven caching is kn...

متن کامل

ABSTRACT Title of dissertation: COMPARING STRENGTH OF LOCALITY OF REFERENCE: POPULARITY, TEMPORAL CORRELATIONS, AND SOME FOLK THEOREMS FOR THE MISS RATES AND OUTPUTS OF CACHES

Title of dissertation: COMPARING STRENGTH OF LOCALITY OF REFERENCE: POPULARITY, TEMPORAL CORRELATIONS, AND SOME FOLK THEOREMS FOR THE MISS RATES AND OUTPUTS OF CACHES Sarut Vanichpun, Doctor of Philosophy, 2005 Dissertation directed by: Professor Armand M. Makowski Department of Electrical and Computer Engineering and Institute for Systems Research The performance of demand-driven caching is kn...

متن کامل

Using Locality Surfaces to Determine Cache Miss Ratios

1 Introduction Caches are and will continue to be important computer components that help alleviate the disparity between processor speeds and main memory speeds. To enable the performance of computer systems to continue to increase, it is important to study and improve the performance of caches. Caches operate on the principle of memory reference locality, namely that programs tend to use a sm...

متن کامل

Modeling strength of locality of reference via notions of positive dependence

The performance of demand-driven caching depends on the locality of reference exhibited by the stream of requests made to the cache. In spite of numerous efforts, no consensus has been reached on how to formally compare streams of requests on the basis of their locality of reference. We take on this issue by introducing the notion of Temporal Correlations (TC) ordering for comparing strength of...

متن کامل

Predictive Sequential Associative Cache

Traditionally, set-associative caches are implemented by comparing all blocks in a cache set in parallel for each reference and then selecting the desired block from the set. By providing more than one location for holding the data for a particular memory address, set associativity reduces the cache miss rate for most programs. The traditional solution is, however, not without cost. As contrast...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004